Computing an Eigenvector with Inverse Iteration
نویسندگان
چکیده
منابع مشابه
Computing an Eigenvector with Inverse Iteration
The purpose of this paper is two-fold: to analyze the behavior of inverse iteration for computing a single eigenvector of a complex square matrix and to review Jim Wilkinson’s contributions to the development of the method. In the process we derive several new results regarding the convergence of inverse iteration in exact arithmetic. In the case of normal matrices we show that residual norms d...
متن کاملAn inverse iteration method for eigenvalue problems with eigenvector nonlinearities
Abstract. Consider a symmetric matrix A(v) ∈ Rn×n depending on a vector v ∈ Rn and satisfying the property A(αv) = A(v) for any α ∈ R\{0}. We will here study the problem of finding (λ, v) ∈ R × Rn\{0} such that (λ, v) is an eigenpair of the matrix A(v) and we propose a generalization of inverse iteration for eigenvalue problems with this type of eigenvector nonlinearity. The convergence of the ...
متن کاملAn Inner-Outer Iteration for Computing PageRank
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Our convergence analysis shows that the algorithm is effective for a crude inner tolerance and is not sensitive to the choice...
متن کاملOn Computing an Eigenvector of a Tridiagonal Matrix
We consider the solution of the homogeneous equation J I x where J is a tridiagonal matrix is a known eigenvalue and x is the unknown eigenvector corresponding to Since the system is under determined x could be obtained by setting xk and solving for the rest of the elements of x This method is not entirely new and it can be traced back to the times of Cauchy In Wilkinson demonstrated that in ni...
متن کاملInverse Iteration on Defective Matrices
Very often, inverse iteration is used with shifts to accelerate convergence to an eigenvector. In this paper, it is shown that, if the eigenvalue belongs to a nonlinear elementary divisor, the vector sequences may diverge even when the shift sequences converge to the eigenvalue. The local behavior is discussed through a 2 X 2 example, and a sufficient condition for the convergence of the vector...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 1997
ISSN: 0036-1445,1095-7200
DOI: 10.1137/s0036144596300773